Complete extension of general logic programs
نویسندگان
چکیده
منابع مشابه
Negation-Complete Logic Programs
We give a short, direct proof that a logic program is negationcomplete if, and only if, it has the cut-property. The property negationcomplete refers to three-valued models, the cut-property is defined in terms of ESLDNF-computations only.
متن کاملApproximating General Logic Programs
Consider an informal speciication S 1 containing the closed world assumption (CWA) for its domain of discourse, the speciication S 2 obtained from S 1 by removing CWA, a general logic program formalizing S 1 , and an extended logic program T formalizing S 2. We will say that T is an approximation of. The goal of this paper is to investigate the relationship between formalizations and T. In part...
متن کاملUniversit a Di Pisa Programming by Combining General Logic Programs Programming by Combining General Logic Programs
The program composition approach can be fruitfully applied to combine general logic programs, i.e. logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) composition operations over general programs increases the knowledge representation capabilities of logic programming for non-monotonic reasoning. Examples of modular programming, hier...
متن کاملExtension of Logic regression to Longitudinal data: Transition Logic Regression
Logic regression is a generalized regression and classification method that is able to make Boolean combinations as new predictive variables from the original binary variables. Logic regression was introduced for case control or cohort study with independent observations. Although in various studies, correlated observations occur due to different reasons, logic regression have not been studi...
متن کاملA Complete Logic Fo Programs Visa Nonstandar
In Computer Science and related fields there: have been around logical system in which reasoning about consequences of actkt!i: is also possible. I.e. in addition to being able to say “All humans are mortal.“, “Sokrates is human.” etc. we are ako allowed to say “‘After throwing the switch there ,liirill be light.” or “After touching the hot stove there will be pain.“. The new patterns of though...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90039-i